Decomposition of Constraint Automata
نویسندگان
چکیده
Reo is a coordination language that can be used to model different systems. Constraint automata form a formal semantics for Reo connectors based on a co-algebraic model of streams. In this paper, we introduce complete constraint automata (CCA) whose extra information about entropy states helps in analyzing and decomposing them into Reo circuits. We show that a complete constraint automaton is invertible. This property helps to partition and decompose a constraint automaton, a process which can be utilized to synthesize Reo circuits from constraint automata, automatically.
منابع مشابه
Decomposing Global Grammar Constraints
A wide range of constraints can be specified using automata or formal languages. The GRAMMAR constraint restricts the values taken by a sequence of variables to be a string from a given context-free language. Based on an AND/OR decomposition, we show that this constraint can be converted into clauses in conjunctive normal form without hindering propagation. Using this decomposition, we can prop...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملEvaluating the Effectiveness of Integrated Benders Decomposition Algorithm and Epsilon Constraint Method for Multi-Objective Facility Location Problem under Demand Uncertainty
One of the most challenging issues in multi-objective problems is finding Pareto optimal points. This paper describes an algorithm based on Benders Decomposition Algorithm (BDA) which tries to find Pareto solutions. For this aim, a multi-objective facility location allocation model is proposed. In this case, an integrated BDA and epsilon constraint method are proposed and it is shown that how P...
متن کاملEecient Learning of Real Time One-counter Automata Eecient Learning of Real Time One Counter Automata
We present an eecient learning algorithm for languages accepted by deterministic real time one counter automata (ROCA). The learning algorithm works by rst learning an initial segment, B n , of the innnite state machine that accepts the unknown language and then decomposing it into a complete control structure and a partial counter. A new eecient ROCA decomposition algorithm, which will be pres...
متن کاملTime-Series Constraints: Improvements and Application in CP and MIP Contexts
A checker for a constraint on a variable sequence can often be compactly specified by an automaton, possibly with accumulators, that consumes the sequence of values taken by the variables; such an automaton can also be used to decompose its specified constraint into a conjunction of logical constraints. The inference achieved by this decomposition in a CP solver can be boosted by automatically ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010